The ascent-descent property for $2$-term silting complexes
نویسندگان
چکیده
منابع مشابه
Descent of Semidualizing Complexes for Rings with the Approximation Property
Let R be a commutative noetherian local ring with completion b R. When R has the approximation property, we prove an approximation result for complexes with finitely generated homology. This is used to investigate descent of semidualizing complexes from b R to R. We show that, if R has the approximation property, then there is a bijective correspondence between semidualizing b R-complexes and s...
متن کاملRecursive Ascent-Descent Parsing
Generalized left-corner parsing was originally presented as a technique for generating a parser for the SLR(1) class of grammars but with far fewer states than the SLR(1) parser. This paper modi es and extends the formulation of left-corner parsers so that it is possible to apply the technique to the LALR(1) and LR(1) classes of grammars. It is further shown that left-corner parsers can be conv...
متن کاملAscent and Descent for Sets of Operators
We extend the notion of ascent and descent for an operator acting on a vector space to sets of operators. If the ascent and descent of a set are both finite then they must be equal and give rise to a canonical decomposition of the space. Algebras of operators, unions of sets and closures of sets are treated. As an application we construct a Browder joint spectrum for commuting tuples of bounded...
متن کاملStair ascent and descent at different inclinations.
The aim of this study was to investigate the biomechanics and motor co-ordination in humans during stair climbing at different inclinations. Ten normal subjects ascended and descended a five-step staircase at three different inclinations (24 degrees, 30 degrees, 42 degrees ). Three steps were instrumented with force sensors and provided 6 dof ground reactions. Kinematics was analysed by a camer...
متن کاملScalaBison Recursive Ascent - Descent Parser Generator
ScalaBison is a parser generator accepting bison syntax and generating a parser in Scala. The generated parser uses the idea of “recursive ascent-descent parsing,” that is, directly encoded generalized left-corner parsing. Of interest is that fact that the parser is generated from the LALR(1) tables created by bison, thus enabling extensions such as precedence to be handled implicitly.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Publicacions Matemàtiques
سال: 2020
ISSN: 0214-1493
DOI: 10.5565/publmat6422007